منابع مشابه
Regularized Newton Methods for Convex Minimization Problems with Singular Solutions
This paper studies convergence properties of regularized Newton methods for minimizing a convex function whose Hessian matrix may be singular everywhere. We show that if the objective function is LC2, then the methods possess local quadratic convergence under a local error bound condition without the requirement of isolated nonsingular solutions. By using a backtracking line search, we globaliz...
متن کاملIterative Reweighted Singular Value Minimization
In this paper we study general lp regularized unconstrained matrix minimization problems. In particular, we first introduce a class of first-order stationary points for them. And we show that the first-order stationary points introduced in [11] for an lp regularized vector minimization problem are equivalent to those of an lp regularized matrix minimization reformulation. We also establish that...
متن کاملGuaranteed Rank Minimization via Singular Value Projection
Minimizing the rank of a matrix subject to affine constraints is a fundamental problem with many important applications in machine learning and statistics. In this paper we propose a simple and fast algorithm SVP (Singular Value Projection) for rank minimization with affine constraints (ARMP) and show that SVP recovers the minimum rank solution for affine constraints that satisfy the restricted...
متن کاملSingular value automata and approximate minimization
The present paper uses spectral theory of linear operators to construct approximately minimal realizations of weighted languages. Our new contributions are: (i) a new algorithm for the SVD decomposition of infinite Hankel matrices based on their representation in terms of weighted automata, (ii) a new canonical form for weighted automata arising from the SVD of its corresponding Hankel matrix a...
متن کاملNonconvex Minimization Problems
I. The central result. The grandfather of it all is the celebrated 1961 theorem of Bishop and Phelps (see [7], [8]) that the set of continuous linear functionals on a Banach space E which attain their maximum on a prescribed closed convex bounded subset X c E is norm-dense in £*. The crux of the proof lies in introducing a certain convex cone in E, associating with it a partial ordering, and ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Equations
سال: 2000
ISSN: 0022-0396
DOI: 10.1006/jdeq.1999.3699